frequent itemset meaning in Chinese
频繁项集
Examples
- A bit string array - based mining algorithm for maximum frequent itemset
基于位串数组的最大频繁项目集挖掘算法 - The problem of fuzzy constraint in frequent itemset mining is studied
摘要研究频繁项集挖掘中的模糊约束问题。 - Most of the previous studies adopt an apriori - like heuristic , that is , any subset of frequent itemset is frequent itemsets
目前绝大多数频繁集产生算法都是采用类似apriori算法的思想即一个频繁集的任意子集都是频繁集。 - Aims at the inherent fault of the apriori algorithm , analyzes and realizes the fp - growth which does not generate candidate mining frequent itemset
针对apriori算法的固有缺陷，对不产生候选挖掘频繁项集方法- - fp - growth频集算法进行分析并加以实现。 - Data mining , association rule , frequent itemset , sample error , multi - scaling sampling references 1 evfimievski a , srikant r , agrawal r , gehrke j . privacypreserving mining of association rules
已有的研究表明：根据数据库的特性，动态的选取样本大小进而获取可接受的近似关联规则的自适应取样方法是解决上述问题的一种好方法。